On a conjecture of Widom
نویسندگان
چکیده
In 1969 Harold Widom published his seminal paper (Widom, 1969) which gave a complete description of orthogonal and Chebyshev polynomials on a system of smooth Jordan curves. When there were Jordan arcs present the theory of orthogonal polynomials turned out to be just the same, but for Chebyshev polynomials Widom’s approach proved only an upper estimate, which he conjectured to be the correct asymptotic behavior. In this note we make some clarifications which will show that the situation is more complicated. c ⃝ 2014 Elsevier Inc. All rights reserved.
منابع مشابه
ar X iv : 1 50 5 . 02 60 4 v 1 [ m at h . C A ] 1 1 M ay 2 01 5 ASYMPTOTICS OF CHEBYSHEV POLYNOMIALS , I . SUBSETS OF R JACOB
We consider Chebyshev polynomials, Tn(z), for infinite, compact sets e ⊂ R (that is, the monic polynomials minimizing the sup–norm, ‖Tn‖e, on e). We resolve a 45+ year old conjecture of Widom that for finite gap subsets of R, his conjectured asymptotics (which we call Szegő–Widom asymptotics) holds. We also prove the first upper bounds of the form ‖Tn‖e ≤ QC(e) (where C(e) is the logarithmic ca...
متن کاملAsymptotics of Chebyshev Polynomials, I. Subsets of R
We consider Chebyshev polynomials, Tn(z), for infinite, compact sets e ⊂ R (that is, the monic polynomials minimizing the sup–norm, ‖Tn‖e, on e). We resolve a 45+ year old conjecture of Widom that for finite gap subsets of R, his conjectured asymptotics (which we call Szegő–Widom asymptotics) holds. We also prove the first upper bounds of the form ‖Tn‖e ≤ QC(e) (where C(e) is the logarithmic ca...
متن کاملOn some generalisations of Brown's conjecture
Let $P$ be a complex polynomial of the form $P(z)=zdisplaystyleprod_{k=1}^{n-1}(z-z_{k})$,where $|z_k|ge 1,1le kle n-1$ then $ P^prime(z)ne 0$. If $|z|
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملOn the Widom-Rowlinson Occupancy Fraction in Regular Graphs
We consider the Widom-Rowlinson model of two types of interacting particles on d-regular graphs. We prove a tight upper bound on the occupancy fraction: the expected fraction of vertices occupied by a particle under a random configuration from the model. The upper bound is achieved uniquely by unions of complete graphs on d + 1 vertices, Kd+1’s. As a corollary we find that Kd+1 also maximizes t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Approximation Theory
دوره 190 شماره
صفحات -
تاریخ انتشار 2015